Programming Techniques for Partial Evaluation ∗
نویسنده
چکیده
These lecture notes describe how to write generating extensions, i.e., dedicated program specializers. The focus is on compositional programs and their associated fold functions. Each generating extension is expressed as an instance of this fold function. A number of examples are considered and pointers to related work are provided. ∗Lecture notes for Marktoberdorf’99, extended version. †Basic Research in Computer Science (http://www.brics.dk/), Centre of the Danish National Research Foundation. ‡Building 540, Ny Munkegade, DK-8000 Aarhus C, Denmark. Phone: (+45) 89 42 33 69. Fax: (+45) 89 42 32 55. E-mail: [email protected] Home page: http://www.brics.dk/~danvy/
منابع مشابه
A Self-Applicable Partial Evaluator for ASM
This paper presents an ooine partial evaluator for Abstract State Machines. Self-application is possible by means of a simpliied version of the partial evaluator written in ASM itself. Using self-application, we have generated compilers for small languages from their interpreter deenitions. We also present techniques for describing the semantics of programming languages, in a way suitable for p...
متن کاملA self-applicable partial evaluator for the logic programming language Goedel
Partial evaluation is a program specialisation technique that has been shown to have great potential in logic programming, particularly for the specialisation of meta-interpreters by the so-called “Futamura Projections”. Meta-interpreters and other meta-programs are programs which use another program as data. In this thesis we describe a partial evaluator for meta-programs in the logic programm...
متن کاملSupercompilation and Normalisation By Evaluation
It has been long recognised that partial evaluation is related to proof normalisation. Normalisation by evaluation, which has been presented for theories with simple types, has made this correspondence formal. Recently Andreas Abel formalised an algorithm for normalisation by evaluation for System F . This is an important step towards the use of such techniques on practical functional programmi...
متن کاملExplanation-Based Generalisation = Partial Evaluation
We argue that explanation-based generalisation as recently proposed in the machine learning literature is essentially equivalent to partial evaluation, a well known technique in the functional and logic programming literature. We show this equivalence by analysing the definitions and underlying algorithms of both techniques, and by giving a Prolog program which can be interpreted as doing eithe...
متن کاملExplanation-based Generalisation = Partial Evaluation 1
We argue that explanation-based generalisation as recently proposed in the machine learning literature is essentially equivalent to partial evaluation, a well known technique in the functional and logic programming literature. We show this equivalence by analysing the deenitions and underlying algorithms of both techniques, and by giving a Prolog program which can be interpreted as doing either...
متن کاملC++ Templates as Partial Evaluation
This paper explores the relationship between C++ templates and partial evaluation. Templates were designed to support generic programming but unintentionally provided the ability to write code generators and perform static computations. These features are accidental, and as a result their syntax and semantics are awkward. Despite being unwieldy, these techniques have become somewhat popular bec...
متن کامل